A Parallel Finite Oct-tree for Multi-threaded Insert, Delete, and Search Operations

نویسندگان

  • T. Binder
  • S. Selberherr
چکیده

We present an object-oriented approach to distribute simulation data (like e.g., geometrical information, meshing information, distributed quantities) used for the simulation of semiconductor fabrication processes such as Monte-Carlo ion implantation [1], etching [2, 3), diffusion [4], and oxidation [5] on a heterogenous cluster of workstations. The approach is based on a finite oct-tree where the data are spread over the network. On SYMMETRIC MULTI PROCESSING (SMP) machines several elements can be handled in parallel (multi-threaded) to speed up insertion, searching, and deletion.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

DeltaTree: A Practical Locality-aware Concurrent Search Tree

As other fundamental programming abstractions in energy-efficient computing, search trees are expected to support both high parallelism and data locality. However, existing highly-concurrent search trees such as red-black trees and AVL trees do not consider data locality while existing locality-aware search trees such as those based on the van Emde Boas layout (vEB-based trees), poorly support ...

متن کامل

Priority Queue Based on Multilevel Prefix Tree

Tree structures are very often used data structures. Among ordered types of trees there are many variants whose basic operations such as insert, delete, search, delete-min are characterized by logarithmic time complexity. In the article I am going to present the structure whose time complexity for each of the above operations is O( K + K), where M is the size of data type and K is constant prop...

متن کامل

Suux Tree Automata in State Space Search

An on{line learning algorithm for pruning state space search is described in this paper. The algorithm is based on a nite state machine which is both created and used in the search. The pruning technique is necessary when memory resources in searching huge problem spaces are restricted. A duplicate sequence is a generating path in the search tree that has a counterpart with smaller weight. The ...

متن کامل

Su x Tree Automata in State Space Search

An on{line learning algorithm for pruning state space search is described in this paper. The algorithm is based on a nite state machine which is both created and used in the search. The pruning technique is necessary when memory resources in searching huge problem spaces are restricted. A duplicate sequence is a generating path in the search tree that has a counterpart with smaller weight. The ...

متن کامل

Fused Trees: Simple BST balancing method by partial & scheduled rebuilds

This paper proposes a simple method to balance a binary search tree, as an attempt to develop the simplest and most explicit procedure. For a given constant k in (0, 0.5), a rebuilt subtree of size n rebuilds itself again after max(1, ⌊kn⌋) insert/delete operations. With a cost, this scheduled rebuild offers implementational advantages. This cost is frequent rebuilds and a single integer value ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014